Double Verifiable Lossless Secret Sharing Based on Hyper-chaos Generated Random Grid

نویسندگان

  • Hang Gao
  • Mengting Hu
  • Tiegang Gao
  • Renhong Cheng
چکیده

A novel multi secret sharing scheme is proposed in this paper. In the scheme, n secret images are firstly encrypted by hyper-chaos whose initial values are hash of the image itself. Then the encrypted images are shuffled into n confused images; lastly, the confused images are used to generate n sharing images using the random grid method. The proposed scheme has the advantage such that it can lossless restore the original secret image, and have the double verification ability, that is to say, it can verify whether the anyone of the sharing is modified, and it can also verify the whether the anyone of the original secret image is completely reconstructed. The above advantages make it especially suitable for secret sharing of important images such as medical and military images. Experimental results and some comparison analysis are given to testify the effectiveness of the proposed scheme.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves

‎In a (t,n)-threshold secret sharing scheme‎, ‎a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together‎, ‎but no group of fewer than t participants can do‎. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao‎, ‎and the intractability of the elliptic curve discrete logar...

متن کامل

A Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions

A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...

متن کامل

An Off-Line Electronic Payment Scheme based on Publicly Verifiable Secret Sharing

In this paper, we introduce a new efficient technique allowing to render an off-line e-cash system traceable without need to a trusted party. The main idea is the use of the publicly verifiable secret sharing technique in order to revoke the anonymity of double spending users. The anonymity of honest users is still provided. Security analysis shows that the proposed technique does not undermine...

متن کامل

Improved Double Auction Protocol based on a Hybrid Trust Model

Recently, Wang et al. proposed a set of double auction protocols with full privacy protection based on distributed ElGamal encryption. Unfortunately, their protocols are expensive in computation, and are not robust in dealing with system malfunction or user misbehavior. In this paper, we propose a secure and practical double auction protocols based on a hybrid trust model, where computation loa...

متن کامل

A Publicly Verifiable Secret Sharing Scheme Based on Multilinear Diffie-Hellman Assumption

Using multiple linear of multilinear map, we propose a simple, non-interactive and effective publicly verifiable secret sharing (PVSS) scheme based on multilinear DiffieHellman assumption (MDH). Up to now, the publicly verifiable of secret sharing is still an issue. In this paper, we set the sharing secret is a multiple linear pairing, we apply the multiple linear property of multilinear map fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • I. J. Network Security

دوره 19  شماره 

صفحات  -

تاریخ انتشار 2017